New Deterministic Algorithms for Counting Pairs of Intersecting Segments and Off-Line Triangle Range Searching
نویسندگان
چکیده
We describe a new method for decomposing planar sets of segments and points. Using this method we obtain new efficient deterministic algorithms for counting pairs of intersecting segments, and for answering off-line triangle rang'e queries. In particular we obtain the following results: (1) Given n segments in the plane, the number K of pairs of intersecting segments is computed in time O(nl+ f + K 1/3n2/3+ f ), where € > 0 an arbitrarily
منابع مشابه
Algorithms for Generalized Halfspace Range Searching and Other Intersection Searching Problems
In a generalized intersection searching problem, a set S of colored geometric objects is to be preprocessed so that, given a query object q, the distinct colors of the objects of S that are intersected by q can be reported or counted efficiently. These problems generalize the well-studied standard intersection searching problems and have many applications. Unfortunately, the solutions known for...
متن کاملAn Elementary Algorithm for Reporting Intersections of Red/Blue Curve Segments
Let and be two sets of -monotone and non-intersecting curve segments, and . We give a new sweep-line algorithm that reports the intersecting pairs of segments of . Our algorithm uses only three simple predicates that allow to decide if two segments intersect, if a point is left or right to another point, and if a point is above, below or on a segment. These three predicates seem to be the simpl...
متن کاملLINE-SEGMENTS CRITICAL SLIP SURFACE IN EARTH SLOPES USING AN OPTIMIZATION METHOD
In this paper the factor of safety (FS) and critical line-segments slip surface obtained by the Alternating Variable Local Gradient (AVLG) optimization method was presented as a new topic in 2D. Results revealed that the percentage of reduction in the FS obtained by switching from a circular shape to line segments was higher with the AVLG method than other methods. The 2D-AVLG optimization meth...
متن کاملAn Analysis of ‘Triangle Ordering’ in Foreign Exchange Market (Forex): Simultaneous Ordering of Three Major Currency Pairs
With considering a ‘triangle of three major currency pairs’, there is a tiny difference between multiplication of exchange rate for the first two currency pairs and the third. To discover whether this little difference can lead to a neutral arbitrage or not, I took portfolios of 35 baskets of three major currency pairs(combinations of all 7 major currencies). There are eight approaches (differe...
متن کاملAlgorithms for graphs of bounded treewidth via orthogonal range searching
We show that, for any fixed constant k ≥ 3, the sum of the distances between all pairs of vertices of an abstract graphs with n vertices and treewidth at most k can be computed in O(n logk−1 n) time. We also show that, for any fixed constant k ≥ 2, the dilation of a geometric graph (i.e., a graph drawn in the plane with straight-line segments) with n vertices and treewidth at most k can be comp...
متن کامل